Query Processing Using Distance Oracles for Spatial Networks
نویسندگان
چکیده
منابع مشابه
Path Oracles for Spatial Networks
The advent of location-based services has led to an increased demand for performing operations on spatial networks in real time. The challenge lies in being able to cast operations on spatial networks in terms of relational operators so that they can be performed in the context of a database. A linear-sized construct termed a path oracle is introduced that compactly encodes the n2 shortest path...
متن کاملApproximate Distance Oracles with Improved Query Time
Given an undirected graph G with m edges, n vertices, and non-negative edge weights, and given an integer k ≥ 2, we show that a (2k − 1)-approximate distance oracle for G of size O(kn) and with O(log k) query time can be constructed in O(min{kmn1/k, √ km+kn √ k}) time for some constant c. This improves the O(k) query time of Thorup and Zwick. Furthermore, for any 0 < ǫ ≤ 1, we give an oracle of...
متن کاملPrivacy Protected Query Processing on Spatial Networks
Privacy Protected spatial queries refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of Privacy Protected spatial query is of critical importance with the everincreasing deployment and use of mobile technologies. We show that Privacy Protected spatial query have certain unique characteristics that the traditional spatial query processing in central...
متن کاملQuery Processing for Distance Metrics
In applications such as vision and molecular biology, a common problem is to find the similar objects to a given target (according to some distance measure) in a large database. This paper presents a scheme for query processing in such situations. The basic strategy is to (partially) precompute inter-object distances, and by using the distance information and the triangle inequality, we elimina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2010
ISSN: 1041-4347
DOI: 10.1109/tkde.2010.75